#include<bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
#define pb push_back
#define lowbit(x) (x&(-x))
#define m_p make_pair
typedef long long ll;
int a[100005];
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    int n;cin>>n;
    for(int i=0;i<n;i++) cin>>a[i];
    sort(a,a+n);
    priority_queue<int,vector<int>,greater<int> > q;
    int ans=n;
    for(int i=0;i<n;i++){
        if(!q.empty()){
            if(q.top()<a[i]){
                q.pop();
                ans--;
            }
        }
        q.push(a[i]);
    }
    cout<<ans<<endl;
    return 0;
}